A solution approach of production planning problems based on compact formulations for single-item lot-sizing models

نویسنده

  • Mathieu Van Vyve
چکیده

Acknowledgments I would like to express my gratitude to my two supervisors, Yves Pochet and Laurence Wolsey. It is difficult to imagine somebody more available for discussion than Yves Pochet. Even when he was crumbling under administrative work, he always had time to spend for discussing my work in progress. Laurence Wolsey have been a continuous source of inspiration and intellectual motivation. By regularly organizing non-scientific activities, he also has been more than a supervisor. Finally, I guess he spent many dozens of hours trying to read my unreadable drafts. If the present text is somewhat readable, it is more his achievement than mine. When I began my PhD in September 1999, I did not know anything about discrete optimization. I simply could not have done this work without them. Thank you. I am also grateful to the LISCOS project for funding. I am in debt to the project, and to my supervisors, as I has been originally hired to develop heuristics for production planning problems. Now, this thesis hardly contains a single paragraph on the subject. People of the LISCOS project, and my supervisors in particular, never complained about this. Thank you. A special thanks to Wim van de Velde from Procter&Gamble for providing the problems Gemini and PG1 of Chapter 7. Some of the work presented here is the outcome of teamwork. The second chapter is partly the result of many years of hard thinking of Francisco Ortega. The fifth chapter is my contribution to a joint work with Andrew Miller and Miguel Constantino. I also want to thank the members of the jury in general for their fruitful comments on ealier versions of the text. CORE is a wonderful place for working, because it is much more than the building where you go every morning. There are wonderful people in there, who I will regret for a long time. I began my research at the same time as Quentin. I wish I could have beaten him more often at tennis. I could also count on the great friendship of Pancho. Pancho, I must thank you for introducing me to the arcane of all softwares related to my research. My soccer and squash skills have also greatly improved thanks to you. My numerous conversations with Christine and Mady have been healthily refreshing in a sometimes arid scientific environment. In order of appearance, I also want to Eloisa for …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Mathematical Model For A Lot-Sizing Problem In Closed-Loop Supply Chain

The aim of lot sizing problems is to determine the periods where production takes place and the quantities to be produced in order to satisfy the customer demand while minimizing the total cost. Due to its importance on the efficiency of the production and inventory systems, Lot sizing problems are one of the most challenging production planning problems and have been studied for many years wit...

متن کامل

A Vibration Damping Optimization Algorithm for Solving the Single-item Capacitated Lot-sizing Problem with Fuzzy Parameters

In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...

متن کامل

Mathematical Programming Models and Formulations for Deterministic Production Planning Problems

We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning problems. The objective is to present the classical optimization approaches used, and the known models, for dealing with such management problems. We describe first production planning models in the general context of manufacturing p...

متن کامل

Formulations for Dynamic Lot Sizing with Service Levels

In this paper, we study deterministic dynamic lot-sizing problems with service level constraints on the total number of periods in which backorders can occur over the finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS-SL-I) and study the structure of its solution. We show that an optimal solution to this problem can be found in O(n2κ...

متن کامل

A POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE

The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...

متن کامل

A Basic Period Approach for Solving the Economic Lot and Delivery Scheduling in Flexible Flow Lines

In this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. Single supplier via a flexible flow line production system (FFL), produces several items and delivers them directly to an assembly facility. Based on basic period (BP) strategy, a new mixed zero-one nonlinear programming model has been develop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • 4OR

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2004